Selecting Optimal Submatrix for Syndrome-Trellis Codes (STCs)-Based Steganography With Segmentation
نویسندگان
چکیده
منابع مشابه
Concatenated space–time trellis codes with optimal puncturing patterns
The performance of space–time trellis codes (STTCs) serially concatenated with convolutional codes and Bose–Chaudhuri–Hocquenghem codes is evaluated over quasistatic Rayleigh fading channels. The STTCs are used as inner codes since they provide diversity owing to their multi-antenna nature. The loss in spectral efficiency incurred due to the added redundancy from the outer codes is dealt with b...
متن کاملTrellis-coded quantization for public-key steganography
This paper deals with public-key steganography in the presence of a passive warden. The aim is to hide secret messages within cover-documents without making the warden suspicious, and without any preliminar secret key sharing. Whereas a practical attempt has been already done to provide a solution to this problem, it suffers of poor flexibility (since embedding and decoding steps highly depend ...
متن کاملOptimal Generation of Space-Time Trellis Codes via Coset Partitioning
Criteria to design good space-time trellis codes (STTCs) have been already developed in previous publications. However, the computation of the best STTCs is time-consuming because a long exhaustive or systematic computing search is required, especially for a high number of states and/or transmit antennas. In order to reduce the search time, an efficient method must be employed to generate the S...
متن کاملTrellises and Trellis-Based Decoding Algorithms for Linear Block Codes
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. Al...
متن کاملGraph-based iterative decoding algorithms for parity-concatenated trellis codes
In this paper, we construct parity-concatenated trellis codes in which a trellis code is used as the inner code and a simple parity-check code is used as the outer code. From the Tanner–Wiberg–Loeliger (TWL) graph representation, several iterative decoding algorithms can be derived. However, since the graph of the parity-concatenated code contains many short cycles, the conventional min-sum and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2983869